The flexible incomplete LU preconditioner for large nonsymmetric linear systems
نویسندگان
چکیده
The ILU factorization is one of the most popular preconditioners for the Krylov subspace method, alongside the GMRES. Properties of the preconditioner derived from the ILU factorization are relayed onto the dropping rules. Recently, Zhang et al. [Numer. Linear. Algebra. Appl., Vol. 19, pp. 555–569, 2011] proposed a Flexible incomplete Cholesky (IC) factorization for symmetric linear systems. This paper is a study of the extension of the IC factorization to the nonsymmetric case. The new algorithm is called the Crout version of the flexible ILU factorization, and attempts to reduce the number of nonzero elements in the preconditioner and computation time during the GMRES iterations. Numerical results show that our approach is effective and useful. key words. ILU Factorization, preconditioner, GMRES AMS(MOS) subject classifications. 65F10, 65K10
منابع مشابه
Computing a block incomplete LU preconditioner as the by-product of block left-looking A-biconjugation process
In this paper, we present a block version of incomplete LU preconditioner which is computed as the by-product of block A-biconjugation process. The pivot entries of this block preconditioner are one by one or two by two blocks. The L and U factors of this block preconditioner are computed separately. The block pivot selection of this preconditioner is inherited from one of the block versions of...
متن کاملMultilevel ILU With Reorderings for Diagonal Dominance
This paper presents a preconditioning method based on combining two-sided permutations with a multilevel approach. The nonsymmetric permutation exploits a greedy strategy to put large entries of the matrix in the diagonal of the upper leading submatrix. The method can be regarded as a complete pivoting version of the incomplete LU factorization. This leads to an effective incomplete factorizati...
متن کاملBIT ? ? ( 199 ? ) , ? ? ? { ? ? ? . An Assessment of Incomplete - LU Preconditioners forNonsymmetric Linear Systems
We report on an extensive experiment to compare an iterative solver preconditioned by several versions of incomplete LU factorization with a sparse direct solver using LU factorization with partial pivoting. Our test suite is 24 nonsymmetric matrices drawn from benchmark sets in the literature. On a few matrices, the best iterative method is more than 5 times as fast and more than 10 times as m...
متن کاملA Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
This paper is concerned with a new approach to preconditioning for large sparse linear systems A procedure for computing an incomplete factorization of the inverse of a nonsymmetric matrix is developed and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient type methods Some theoretical properties of the preconditioner are discussed a...
متن کاملNew updates of incomplete LU factorizations and applications to large nonlinear systems
In this paper, we address the problem of preconditioning sequences of large sparse nonsymmetric systems of linear equations and present two new strategies to construct approximate updates of factorized preconditioners. Both updates are based on the availability of an incomplete LU (ILU) factorization for one matrix of the sequence and differ in the approximation of the so-called ideal updates. ...
متن کامل